#include<stdio.h>
#include<malloc.h>
#define Maxsize 100
typedef char ElemType;
typedef struct
{
ElemType data[Maxsize];
int top	;
 }sqstack;
 
void InitStack(sqstack *&s)
{
	s=(sqstack*)malloc(sizeof(sqstack));
	s->top=-1;
}
  
 void Destorystack(sqstack *&s )
{
	free(s);
}

bool stackEmpty(sqstack *&s)
{
	return(s->top==-1);
}

bool Push(sqstack *&s,ElemType e)
{
	if(s->top==Maxsize-1)
		return false;
	s->top++;
	s->data[s->top]=e;
	return true;
}

bool Pop(sqstack *&s,ElemType e)
{
	if(s->top==-1)
		return false;
	e=s->data[s->top];
	s->top--;
	return true;
}

bool GetTop(sqstack *&s,ElemType e)
{
	if(s->top==-1)
		return false;
	e=s->data[s->top];
	return true;
}

int main()
{
	ElemType e;
	sqstack *s;
	printf("顺序栈是s的基本运算如下：\n");
	printf("(1)初始化栈s\n");
	InitStack(s);
	printf("(2)进栈的顺序为%s\n",stackEmpty(s)?"空":"非空");
	printf("(3)依次进栈的元素a,b,c,d,e\n");
	Push(s,'a');
	Push(s,'b');
	Push(s,'c');
	Push(s,'d');
	Push(s,'e');
	printf("(4)栈为%s\n",stackEmpty(s)?"空":"非空");
	printf("(5)出栈序列：");
	while(!stackEmpty(s))
	{
		Pop(s,e);
		printf("%c",e);
    } 
    printf("\n");
    printf("(6)栈为%s\n",stackEmpty(s)?"空":"非空");
    printf("(7)释放栈\n");
    Destorystack(s);
    return 0;
}